Fast Graph Simplification for Interleaved-Dyck Reachability

Many program-analysis problems can be formulated as graph-reachability problems. Interleaved Dyck language reachability ( InterDyck -reachability) is a fundamental framework to express wide variety of over edge-labeled graphs. The represents an intersection multiple matched-parenthesis languages (i.e., languages). In practice, program analyses typically leverage one achieve context-sensitivity, and other model data dependencies, such field-sensitivity pointer references/dereferences. the ideal case, -reachability should simultaneously . Unfortunately, precise undecidable. Any practical solution must over-approximate exact answer. literature, lot work has been proposed formulation. This article offers new perspective on improving both precision scalability -reachability: we aim at simplifying underlying input graph G Our key insight based observation that if edge not contributing any -paths, safely eliminate it from technique orthogonal formulation serve pre-processing step with over-approximating approach for -reachability. We have applied our simplification algorithm graphs recent -reachability-based taint analysis Android. evaluation three popular algorithms yields promising results. particular, graph-simplification method improves all algorithms, sometimes dramatically.